Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
¿¬¼Ó Top-k ÁúÀÇ ¸ð´ÏÅ͸µÀ» À§ÇÑ È¿À²ÀûÀÎ ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
An Efficient Algorithm for Monitoring Continuous Top-k Queries |
ÀúÀÚ(Author) |
ÀåÀçÈñ
Á¤Çϸ²
±è¿ëÈñ
±èÀÀ¸ð
JaeHee Jang
HaRim Jung
YougHee Kim
Ung-Mo Kim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 43 NO. 05 PP. 0590 ~ 0595 (2016. 05) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â ±âÁ¸ °ø°£ ¼Ó¼º¸¸À» °í·ÁÇÏ´Â ±×¸®µå ±â¹ÝÀÇ »öÀÎ ±â¹ýÀ» º¯ÇüÇÏ¿© º¸´Ù ºü¸¥ ¿¬»êÀ» ¼öÇàÇÏ´Â »óÀ§-k ÁúÀÇ ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈÇÏ´Â ±â¹ýÀº À̵¿ °´Ã¼ÀÇ °ø°£ ¼Ó¼º »Ó¸¸ ¾Æ´Ï¶ó ºñ°ø°£ ¼Ó¼ºÀ» È°¿ëÇÏ¿© »ç¿ëÀÚ°¡ ¼±È£ÇÏ´Â Á¤º¸¸¦ È¿°úÀûÀ¸·Î °Ë»öÇÒ ¼ö ÀÖ´Â ¸ÞÀθ޸𸮠±â¹Ý ±×¸®µå »öÀÎ ±¸Á¶ÀÎ Bit-Vector Grid Index(BVGI)¸¦ ±¸ÃàÇÑ´Ù. ±×¸®µåÀÇ °¢ ¼¿Àº À̵¿°´Ã¼ÀÇ ºñ°ø°£ ¼Ó¼º °ªÀ» ºñÆ® º¤ÅÍ·Î ºÎÈ£ÈÇÏ¿© À̵¿ °´Ã¼°¡ ¾î¶² ¼¿¿¡ Æ÷ÇԵǾî ÀÖ´ÂÁö ºü¸£°Ô ÆÇ´ÜÇÒ ¼ö ÀÖ°í, °¢ ¼¿¿¡ Á¸ÀçÇÏ´Â À̵¿°´Ã¼ÀÇ ºñÆ® º¤Å͸¸À» ºñ±³ÇÏ¿© ºÒÇÊ¿äÇÑ ¿¬»êÀ» ÁÙÀÏ ¼ö ÀÖ´Ù. ¼º´É Æò°¡¸¦ ÅëÇØ Á¦¾ÈÇÏ´Â BVGI ±â¹ýÀÌ ±âÁ¸ÀÇ ÁúÀÇ Ã³¸® ±â¹ýº¸´Ù ¸Þ¸ð¸® »ç¿ë·®°ú CPU-time Ãø¸é¿¡¼ ¿ì¼öÇÔÀ» º¸¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
In this study, we propose an efficient method for monitoring continuous top-k queries. In contrast to the conventional top-k queries, the presented top-k query considers both spatial and non-spatial attributes. We proposed a novel main-memory based grid access method, called Bit-Vector Grid Index (BVGI). The proposed method quickly identifies whether the moving objects are included in some of the grid cell by encoding a non-spatial attribute value of the moving object to bit-vector. Experimental simulations demonstrate that the proposed method is several times faster than the previous method and uses considerably less memory.
|
Å°¿öµå(Keyword) |
À§Ä¡ ±â¹Ý ¼ºñ½º
¿¬¼Ó Top-k ÁúÀÇ
¸ð´ÏÅ͸µ
À̵¿ °´Ã¼
±×¸®µå »öÀÎ ±¸Á¶
location-based services
continuous Top-k query
monitoring
moving object
grid index structure
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|